DOT and DOP: Linearly Convergent Algorithms for Finding Fixed Points of Multi-Agent Operators
نویسندگان
چکیده
This paper investigates the distributed fixed-point finding problem for a global operator over directed and unbalanced multi-agent network, where is quasi-nonexpansive only partially accessible to each individual agent. Two cases are addressed, that is, sum separable block separable. For this first case, of local operators, which assumed be Lipschitz, privately known To deal with scenario, (or decentralized) algorithm, called Distributed quasi-averaged Operator Tracking algorithm (DOT), proposed analyzed, it shown can converge fixed point at linear rate under regularity condition, strictly weaker than strong convexity assumption on cost functions in existing convex optimization literature. second composed group mappings Lipschitz accessed by In setup, Playing (DOP), developed linearly convergent condition. The above studied problems provide unified framework many interesting problems. As examples, DOT DOP exploited cope multi-player games partial-decision information. Finally, numerical examples presented corroborate theoretical results.
منابع مشابه
points and convergent process operators
We present a strategy for nding algebraic correctness proofs for communication systems. It is described in the setting of CRL 11], which is, roughly, ACP 2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in 4] and 10], but was not explicitly identiied as such. Moreover, the protocols that were veriied in thes...
متن کاملConvergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems
In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...
متن کاملIterative algorithms for families of variational inequalities fixed points and equilibrium problems
متن کامل
Iterative methods for finding nearest common fixed points of a countable family of quasi-Lipschitzian mappings
We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...
متن کاملAn Explicit Viscosity Iterative Algorithm for Finding Fixed Points of Two Noncommutative Nonexpansive Mappings
We suggest an explicit viscosity iterative algorithm for finding a common element in the set of solutions of the general equilibrium problem system (GEPS) and the set of all common fixed points of two noncommuting nonexpansive self mappings in the real Hilbert space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2023
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2023.3312137